Fritz john second-order duality for nonlinear programming
نویسندگان
چکیده
Abstract-A second-order dual to a nonlinear programming problem is formulated. This dual uses the Ritz John necessary optimality conditions instead of the Karush-Kuhn-Tucker necessary optimal&y conditions, and thus, does not require a constraint qualification. Weak, strong, strictconverse, and converse duality theorems between primal and dual problems are established. @ 2001 Elsevier Science Ltd. All rights reserved.
منابع مشابه
Optimality and Duality for an Efficient Solution of Multiobjective Nonlinear Fractional Programming Problem Involving Semilocally Convex Functions
In this paper, the problem under consideration is multiobjective non-linear fractional programming problem involving semilocally convex and related functions. We have discussed the interrelation between the solution sets involving properly efficient solutions of multiobjective fractional programming and corresponding scalar fractional programming problem. Necessary and sufficient optimality...
متن کاملOptimality Conditions and Second-Order Duality for Nondifferentiable Multiobjective Continuous Programming Problems
Fritz John and Karush-Kuhn-Tucker type optimality conditions for a nondifferentiable multiobjective variational problem are derived. As an application of Karush-Kuhn-Tucker type optimality conditions, Mond-weir type second-order nondifferentiable multiobjective dual variational problems is constructed. Various duality results for the pair of Mond-Weir type second-order dual variational problems...
متن کاملAn Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem
A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...
متن کاملConvex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions
We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...
متن کاملCarathéodory–john-type Sufficiency Criteria in Continuous-time Nonlinear Programming under Generalized (α, Ρ)− (η, Θ)-type I Invexity
Continuous-time linear programming was first introduced by Bellman [1] in the treatment of production and inventory “bottleneck” problems. He formulated the dual problem, established a weak duality theorem and described sufficient optimality conditions. Tyndall [12] extended Bellman’s theory and obtained existence and duality theorems for a class of continuous linear programming problem. Levins...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Appl. Math. Lett.
دوره 14 شماره
صفحات -
تاریخ انتشار 2001